Computing NodeTrix Representations of Clustered Graphs

نویسندگان

  • Giordano Da Lozzo
  • Giuseppe Di Battista
  • Fabrizio Frati
  • Maurizio Patrignani
چکیده

NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and intercluster edges as curves connecting the matrix boundaries. We study the complexity of constructing NodeTrix representations focusing on planarity testing problems, and we show several NP-completeness results and some polynomial-time algorithms. Building on such algorithms we develop a JavaScript library for NodeTrix representations aimed at reducing the crossings between edges incident to the same matrix.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NodeTrix Planarity Testing with Small Clusters

We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant k. We consider both the case when the sides of the matrices to which the edges are incident are fixed and the case when they can be arbitrarily chosen. We show that NodeTrix planarity testing with fixed sides can be solved in O(k 3 2 n) time for every flat clu...

متن کامل

NodeTrix: Hybrid Representation for Analyzing Social Networks

The need to visualize large social networks is growing as hardware capabilities make analyzing large networks feasible and many new data sets become available. Unfortunately, the visualizations in existing systems do not satisfactorily answer the basic dilemma of being readable both for the global structure of the network and also for detailed analysis of local communities. To address this prob...

متن کامل

Computing Wiener and hyper–Wiener indices of unitary Cayley graphs

The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.

متن کامل

Applications of some Graph Operations in Computing some Invariants of Chemical Graphs

In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.

متن کامل

Convex drawings of hierarchical planar graphs and clustered planar graphs

Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, software visualisation and visualisation of social networks and biological networks. Straight-line drawing algorithms for hierarchical graphs and clustered graphs have been presented in [P. Eades, Q. Feng, X. Lin and H. Nag...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Graph Algorithms Appl.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2016